Maximum Pagenumber-k Subgraph is NP-Complete
نویسندگان
چکیده
Given a graph G with a total order defined on its vertices, the Maximum Pagenumber-k Subgraph Problem asks for a maximum subgraph G′ of G such that G′ can be embedded into a k-book when the vertices are placed on the spine according to the specified total order. We show that this problem is NP-complete for k ≥ 2.
منابع مشابه
On the Pagenumber of Bipartite Orders
The pagenumber problem for ordered sets is known to be NP-complete, even if the order of the elements on the spine is fixed. In this paper, we investigate this problem for some classes of ordered sets. We provide an efficient algorithm for drawing bipartite interval orders in the minimum number of pages needed. We also give an upper bound for the pagenumber of general bipartite ordered sets and...
متن کاملOn maximum planar induced subgraphs
The nonplanar vertex deletion or vertex deletion vd(G) of a graph G is the smallest nonnegative integer k, such that the removal of k vertices from G produces a planar graph G′. In this case G′ is said to be a maximum planar induced subgraph of G. We solve a problem proposed by Yannakakis: find the threshold for the maximum degree of a graph G such that, given a graph G and a nonnegative intege...
متن کاملQuasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs
We propose a new Maximum Subgraph algorithm for first-order parsing to 1endpoint-crossing, pagenumber-2 graphs. Our algorithm has two characteristics: (1) it separates the construction for noncrossing edges and crossing edges; (2) in a single construction step, whether to create a new arc is deterministic. These two characteristics make our algorithm relatively easy to be extended to incorporia...
متن کاملOn the Largest Common Subgraph Problem
Given two graphs Gi = (Vi, Ei) and G2 = (V2, £2), |Vi| = \V2\ = n, to determine whether they have a size-A; common subgraph is one of the earliest examples of an NP-complete problem (by a trivial reduction from the Maximum Clique problem). We show that this problem for equally sized G\ and G2, i.e. when |23i| = |2?2| = m, remains NP-complete. Moreover, the restriction to the case k = m—tfn, c> ...
متن کاملSplitting Number is NP-complete
We consider two graph invariants that are used as a measure of nonplanarity: the splitting number of a graph and the size of a maximum planar subgraph. The splitting number of a graph G is the smallest integer k 0, such that a planar graph can be obtained from G by k splitting operations. Such operation replaces a vertex v by two nonadjacent vertices v1 and v2, and attaches the neighbors of v e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1504.05908 شماره
صفحات -
تاریخ انتشار 2015